Words whose complexity satisfies limp(n)n=1
نویسندگان
چکیده
منابع مشابه
Cyclic Complexity of Words
We introduce and study a new complexity function on words, that we call cyclic complexity, which counts the number of conjugacy classes of factors of each given length. We extend the famous MorseHedlund theorem to the setting of cyclic complexity by showing that a word is ultimately periodic if and only if it has bounded cyclic complexity. Unlike most complexity functions, cyclic complexity dis...
متن کاملTesting Whether a Set of Code Words Satisfies a Given Set of Constraints
This paper investigates the problem of testing whether a set of code words satisfies certain biologically motivated Hamming distance constraints. The paper provides three efficient techniques to verify the code words, namely, the Enumeration, Table Lookup, and Encoding methods, with applications to the design of DNA words. The Enumeration method enumerates all combinations of positions in a wor...
متن کاملMaximal Complexity of Finite Words
The subword complexity of a finite word w of length N is a function which associates to each n ≤ N the number of all distinct subwords of w having the length n. We define the maximal complexity C(w) as the maximum of the subword complexity for n ∈ {1, 2, . . . , N}, and the global maximal complexity K(N) as the maximum of C(w) for all words w of a fixed length N over a finite alphabet. By R(N) ...
متن کاملThe complexity of tangent words
A smooth curve is a map γ from a compact interval I of the real line to the plane, which is C∞ and such that ||γ ′(t)|| > 0 for any t ∈ I (this last property is called regularity). Any such curve can (and will be considered to) be arc-length reparametrised (i.e. ∀t ∈ I, ||γ ′(t)||= 1). We can approximate such a curve by drawing a square grid of mesh h on the plane, and look at the sequence of s...
متن کاملWords with unbounded periodicity complexity
If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurrent words with the peri-odicity complexity arbitrarily high at infinitely many positions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00091-4